142 research outputs found
An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions
In this paper, we propose an incremental algorithm for computing cylindrical
algebraic decompositions. The algorithm consists of two parts: computing a
complex cylindrical tree and refining this complex tree into a cylindrical tree
in real space. The incrementality comes from the first part of the algorithm,
where a complex cylindrical tree is constructed by refining a previous complex
cylindrical tree with a polynomial constraint. We have implemented our
algorithm in Maple. The experimentation shows that the proposed algorithm
outperforms existing ones for many examples taken from the literature
An Algorithm for Computing the Limit Points of the Quasi-component of a Regular Chain
For a regular chain , we propose an algorithm which computes the
(non-trivial) limit points of the quasi-component of , that is, the set
. Our procedure relies on Puiseux series expansions
and does not require to compute a system of generators of the saturated ideal
of . We focus on the case where this saturated ideal has dimension one and
we discuss extensions of this work in higher dimensions. We provide
experimental results illustrating the benefits of our algorithms
Computing differential characteristic sets by change of ordering
submitted to the Journal of Symbolic ComputationWe describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different languages and has been applied within various software and projects. It permitted to solve formerly unsolved problems
Well known theorems on triangular systems and the D5 principle
International audienceThe theorems that we present in this paper are very important to prove the correctness of triangular decomposition algorithms. The most important of them are not new but their proofs are. We illustrate how they articulate with the D5 principle
- …